By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© 2025 SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 34, Issue 5, pp. 1025-1278

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Bisimulation Problem for Equational Graphs of Finite Out-Degree

Géraud Sénizergues

pp. 1025-1106

Learning Random Log-Depth Decision Trees under Uniform Distribution

Jeffrey C. Jackson and Rocco A. Servedio

pp. 1107-1128

A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

Irit Dinur, Venkatesan Guruswami, Subhash Khot, and Oded Regev

pp. 1129-1146

The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance

Eldar Fischer

pp. 1147-1158

Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata

Kousha Etessami, Thomas Wilke, and Rebecca A. Schuller

pp. 1159-1175

The Complexity of Finding Paths in Graphs with Bounded Independence Number

Arfst Nickelsen and Till Tantau

pp. 1176-1195

Separating the Power of Monotone Span Programs over Different Fields

Amos Beimel and Enav Weinreb

pp. 1196-1215

Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control

Panagiota Fatourou, Marios Mavronicolas, and Paul Spirakis

pp. 1216-1252

Optimal Two-Stage Algorithms for Group Testing Problems

Annalisa De Bonis, Leszek Gasieniec, and Ugo Vaccaro

pp. 1253-1270

Strictly Nonblocking Multirate logd(N,m,p) Networks

Frank K. Hwang, Yong He, and Yang Wang

pp. 1271-1278